Subsumption of Concepts in FL0y for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete
نویسندگان
چکیده
We close the gap in complexity classification of the subsumption problem in the simple description logic FL0, which allows for conjunctions and universal value restriction only. We prove that subsumption in FL0 is PSPACE-complete when cyclic definitions with descriptive semantics are allowed. Our proof uses automata theory and as a by-product the PSPACE-completeness of a certain decision problem for regular languages has been established.
منابع مشابه
Terminological Cycles in a Description Logic with Existential Restrictions
Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles fo...
متن کاملCharacterizing the Semantics of Terminological Cycles in ALN Using Finite Automata
The representation of terminological knowledge may naturally lead to terminological cycles. In addition to descriptive semantics , the meaning of cyclic terminologies can also be captured by xed-point semantics, namely, greatest and least xed-point semantics. To gain a more profound understanding of these semantics and to obtain inference algorithms as well as complexity results for inconsisten...
متن کاملInformatik MCL Master ’ s Thesis on The Subsumption Problem of the Fuzzy Description Logic
Because of the simplicity in the structure of the Description Logic (DL) FL0, it has been commonly taken as the first example for the presentation of new notions and their associated problems [1],[2]. Fuzzy Description Logics extend classical Description Logics by allowing truth degrees to deal with imprecise concepts. In this work we show that in the fuzzy DL FL0 with greatest fixed-point sema...
متن کاملCharacterizing the semantics of terminological cycles with the help of finite automata
The representation of terminological knowledge may naturally lead to terminological cycles. In addition to descriptive semantics, the meaning of cyclic terminologies can also be captured by xed-point semantics. To gain a more profound understanding of these semantics and to obtain inference algorithms for inconsistency, subsumption , and related inference tasks, this paper provides automata the...
متن کاملFinite Lattices Do Not Make Reasoning in ALCI Harder
We consider the fuzzy logic ALCI with semantics based on a finite residuated lattice. We show that the problems of satisfiability and subsumption of concepts in this logic are ExpTime-complete w.r.t. general TBoxes and PSpace-complete w.r.t. acyclic TBoxes. This matches the known complexity bounds for reasoning in crisp ALCI.
متن کامل